package GBP;

import java.util.*;

/**
 * RunEXP.java
 * Created: 2006-01-15 20:30
**/

/**
 * This program solves the Graph-Bipartitioning-Problem 
 *   through KLFM algorithm experiment.
 *
 * @author T.S.Yo
**/

public class RunEXP{
    public static void main(String[] args){
        String expOpt = args[0];
        String iFile = args[1];
        
        int opt = Integer.parseInt(expOpt);
        RunGBP exp1 = new RunGBP(iFile);         // Create a new experiment
        switch(opt){
            case 1:    // Run fixed-number-of-time multi-start FM
                System.out.println("Performing fixed-number Multi-Start FM experiement");
                exp1.runFixedMS();
                break;
            case 2:    // Run multi-start FM till optimum found
                System.out.println("Performing Multi-Start FM till optimum found");
                exp1.runContMS();
                break;
            case 3:    // Run GA-FM with initial population are all local optimum
                System.out.println("Performing GA-FM with ini-population are local optimums");
                exp1.runGA(true);
                break;
            case 4:    // Run GA-FM with random initial population
                System.out.println("Performing GA-FM  with random ini-population");
                exp1.runGA(false);            
                break;
            default:    // Not supported option
                System.out.println("Option "+expOpt+" is not supported.");
                break;
        }
    }
}